A High-Speed Low-Complexity Concatenated BCH Decoder Architecture for 100 Gb/s Optical Communications
نویسندگان
چکیده
This paper presents a two-iteration concatenated Bose-Chaudhuri-Hocquenghem (BCH) code and its highspeed low-complexity two-parallel decoder architecture for 100 Gb/s optical communications. The proposed architecture features a very high data processing rate as well as excellent error correction capability. A low-complexity syndrome computation architecture and a high-speed dual-processing pipelined simplified inversonless Berlekamp-Massey (DualpSiBM) key equation solver architecture were applied to the proposed concatenated BCH decoder with an aim of implementing a high-speed low-complexity decoder architecture. Two-parallel processing allows the decoder to achieve a high data processing rate required for 100 Gb/s optical communication systems. Also, the proposed two-iteration concatenated BCH code structure with block interleaving methods allows the decoder to achieve 8.91dB of net coding gain performance at 10 decoder output bit error rate to compensate for serious transmission quality degradation. Thus, it has potential applications in next generation forward error correction schemes for 100 Gb/s optical communications.
منابع مشابه
A High-Speed Low-Complexity Time-Multiplexing Reed-Solomon-Based FEC Architecture for Optical Communications
A high-speed low-complexity time-multiplexing ReedSolomon-based forward error correction architecture based on the pipelined truncated inversionless Berlekamp-Massey algorithm is presented in this paper. The proposed architecture has very high speed and very low hardware complexity compared with conventional ReedSolomon-based forward error correction architectures. Hardware complexity is improv...
متن کاملOn the higher ef ciency of parallel Reed-Solomon turbo-decoding
In this paper, we demonstrate the higher hardware ef ciency of Reed-Solomon (RS) parallel turbo decoding compared with BCH parallel turbo decoding. Based on an innovative architecture, this is the rst implementation of fully parallel RS turbo decoder. A performance analysis is performed showing that RS Block Turbo Codes (RS-BTC) have decoding performance equivalent to Bose Ray-Chaudhuri Hocque...
متن کاملReduced-complexity column-layered decoding and implementation for LDPC codes
Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s applications. At first, the Min-Sum algorithm is incorporated into the column-layered...
متن کاملA Low-Complexity, High-Speed Reed-Solomon Decoder
This paper presents a low-complexity, high-speed RS(255,239) decoder architecture using Modified Euclidean (ME) algorithm for the high-speed fiber optic communication systems. The RS decoder features a low-complexity key equation solver using a novel pipelined recursive ME algorithm block. Pipelining allows inputs to be received at very high fiber optic rates and outputs to be delivered at corr...
متن کاملReed-Solomon Turbo Product Codes for Optical Communications: From Code Optimization to Decoder Design
Turbo product codes (TPCs) are an attractive solution to improve link budgets and reduce systems costs by relaxing the requirements on expensive optical devices in high capacity optical transport systems. In this paper, we investigate the use of Reed-Solomon (RS) turbo product codes for 40 Gbps transmission over optical transport networks and 10 Gbps transmission over passive optical networks. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal Processing Systems
دوره 66 شماره
صفحات -
تاریخ انتشار 2012